Characterizations of Decomposable Dependency Models

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Characterizations of Decomposable Dependency Models

Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also brieey discuss a potential application of our results to ...

متن کامل

Characterizations of Decomposable Dependency Models

Decomposable dependency models possess a number of interesting and useful properties. This paper presents new characterizations of decomposable models in terms of independence relationships, which are obtained by adding a single axiom to the well-known set characterizing dependency models that are isomorphic to undirected graphs. We also brie y discuss a potential application of our results to ...

متن کامل

Decomposable Log-linear Models Decomposable Log-linear Models

The present paper considers discrete probability models with exact computational properties. In relation to contingency tables this means closed form expressions of the maksimum likelihood estimate and its distribution. The model class includes what is known as decomposable graphical models, which can be characterized by a structured set of conditional independencies between some variables give...

متن کامل

Learning Decomposable Models for Classification

In some situations graphical models are learned to be used for classification of one given variable. The standard learning algorithms usually do not take this background knowledge into account. In the case of Bayesian networks this knowledge is often incorporated by assuming that the target variable will have no parents. This leads to discovering potentially bigger Markov boundaries of the targ...

متن کامل

Approximation of Data by Decomposable Belief Models

It is well known that among all probabilistic graphical Markov models the class of decomposable models is the most advantageous in the sense that the respective distributions can be expressed with the help of their marginals and that the most efficient computational procedures are designed for their processing (for example professional software does not perform computations with Bayesian networ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Artificial Intelligence Research

سال: 1996

ISSN: 1076-9757

DOI: 10.1613/jair.329